Deciding active structural completeness

NP-Completeness of Deciding Binary Genetic Encodability

In previous work of the second author a rigorous mathematical foundation for re-encoding one evolutionary search algorithm by another has been developed. A natural issue to consider then is the complexity of deciding whether or not a given evolutionary algorithm can be re-encoded by one of the standard classical evolutionary algorithms such as a binary genetic algorithm. In the current paper we...

Structural Completeness in Relevance Logics

Deciding Structural Liveness of Petri Nets

Place/transition Petri nets are a standard model for a class of distributed systems whose reachability spaces might be infinite. One of well-studied topics is the verification of safety and liveness properties in this model; despite the extensive research effort, some basic problems remain open, which is exemplified by the open complexity status of the reachability problem. The liveness problem...

On structural completeness versus almost structural completeness problem: A discriminator varieties case study

We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a characterization of structurally complete discriminator varieties. An interesting corollary in logic follows: Let L be a propositional logic/deductive system ...

Almost structural completeness; an algebraic approach

The notion of structural completeness has received considerable attention for many years. A translation to algebra gives: a quasivariety is structurally complete if it is generated by its free algebras. It appears that many deductive systems (quasivarieties), like S5 or MVn fails structural completeness for a rather immaterial reason. Therefore the adjusted notion was introduced: almost structu...